transitive graph

См. также в других словарях:

• Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive …   Wikipedia

• Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group …   Wikipedia

• Edge-transitive graph — In mathematics, an edge transitive graph is a graph G such that, given any two edges e 1 and e 2 of G , there is an automorphism of G that maps e 1 to e 2.In other words, a graph is edge transitive if its automorphism group acts transitively upon …   Wikipedia

• Arc-transitive graph — In mathematics, an arc transitive graph is a graph G such that, given any two edges e 1 = u 1 v 1 and e 2 = u 2 v 2 of G , there are two automorphisms : f : G → G , g : G → G such that : f (e1) = e2, g (e1) = e2and : f ( u 1) = u 2, f ( v 1) = v… …   Wikipedia

• Graph automorphism — In graph theoretical mathematics, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge vertex connectivity.Formally, an automorphism of a graph G = ( V , E ) is a permutation sigma;… …   Wikipedia

• graph´i|ti|za´tion — graph|i|tize «GRAF uh tyz», transitive verb, tized, tiz|ing. 1. to convert (carbon) into graphite. 2. to cover (the surface of an object) with graphite. –graph´i|ti|za´tion, noun …   Useful english dictionary

• graph|i|tize — «GRAF uh tyz», transitive verb, tized, tiz|ing. 1. to convert (carbon) into graphite. 2. to cover (the surface of an object) with graphite. –graph´i|ti|za´tion, noun …   Useful english dictionary

• Transitive reduction — In mathematics, the transitive reduction of a binary relation R on a set X is a minimal relation R on X such that the transitive closure of R is the same as the transitive closure of R . If the transitive closure of R is antisymmetric and finite …   Wikipedia

• Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular …   Wikipedia

• Transitive closure — In mathematics, the transitive closure of a binary relation R on a set X is the smallest transitive relation on X that contains R .For example, if X is a set of airports and xRy means there is a direct flight from airport x to airport y , then… …   Wikipedia

• Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia